Building Compact Competent Case-Bases
نویسندگان
چکیده
Case-based reasoning systems solve problems by reusing a corpus of previous problem solving experience stored as a case-base of individual problem solving cases. In this paper we describe a new technique for constructing compact competent case-bases. The technique is novel in its use of an explicit model of case competence. This allows cases to be selected on the basis of their individual competence contributions. An experimental study shows how this technique compares favorably to more traditional strategies across a range of standard data-sets.
منابع مشابه
Flexible Feature Deletion: Compacting Case Bases by Selectively Compressing Case Contents
Extensive research in case-base maintenance has studied methods for achieving compact, competent case bases. This work has examined how to achieve good solution performance while limiting the number of cases retained, using approaches such as competence-based case deletion. Two fundamental assumptions of such approaches have been (1) that cases are approximately the same size and (2) that the o...
متن کاملJustification-Based Selection of Training Examples for Case Base Reduction
Maintaining compact and competent case bases has become a main topic of Case Based Reasoning (CBR) research. The main goal is to obtain a compact case base (with a reduced number of cases) without losing accuracy. In this work we present JUST, a technique to reduce the size of a case base while maintaining the classification accuracy of the CBR system. JUST uses justifications in order to selec...
متن کاملBracket Products on Locally Compact Abelian Groups
We define a new function-valued inner product on L2(G), called ?-bracket product, where G is a locally compact abelian group and ? is a topological isomorphism on G. We investigate the notion of ?-orthogonality, Bessel's Inequality and ?-orthonormal bases with respect to this inner product on L2(G).
متن کاملProbabilistic Model Building and Competent Genetic Programming
This paper describes a probabilistic model building genetic programming (PMBGP) developed based on the extended compact genetic algorithm (eCGA). Unlike traditional genetic programming, which use fixed recombination operators, the proposed PMBGA adapts linkages. The proposed algorithms, called the extended compact genetic programming (eCGP) adaptively identifies and exchanges non-overlapping bu...
متن کاملIntegrating Probabilistic Modeling and Representation-Building
Optimization algorithms are adaptive when they sample problem solutions based on knowledge of the overall search space gathered from past sampling. Recently, competent adaptive optimization algorithms have been developed that achieve this adaptability via probabilistic modeling of the search space. However, their effectiveness requires the existence of a compact problem decomposition in terms o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999